Assortment optimization over time
نویسندگان
چکیده
In this note we introduce the problem of assortment optimization over time. We have a sequence of time steps and can introduce one new product per time step. Once introduced a product can not be removed. The goal is to determine which products to introduce so as to maximize revenue over all time steps under some choice model. Given a 1/α-approximation algorithm for the capacitated assortment optimization problem we give a 1/2α-approximation algorithm for this problem.
منابع مشابه
Near-Optimal Algorithms for Capacity Constrained Assortment Optimization
Assortment optimization is an important problem that arises in many practical applications such as retailing and online advertising. In an assortment optimization problem, the goal is to select a subset of items that maximizes the expected revenue in the presence of the substitution behavior of consumers specified by a choice model. In this paper, we consider the capacity constrained version of...
متن کاملJoint Optimization of Assortment Selection and Pricing under the Capacitated Multinomial Logit Choice Model with Product-Differentiated Price Sensitivities
Joint Optimization of Assortment Selection and Pricing under the Capacitated Multinomial Logit Choice Model with Product-Differentiated Price Sensitivities Ruxian Wang HP Laboratories HPL-2012-207 Multinomial Logit model; assortment optimization; multi-product price optimization Many firms face a problem to select an assortment of products and determine their prices to maximize the total prof...
متن کاملTechnical Note: A Simple Greedy Algorithm for Assortment Optimization in the Two-Level Nested Logit Model
We consider the assortment optimization problem under the classical two-level nested logit model. We establish a necessary and sufficient condition for the optimal assortment, and use this optimality condition to develop a simple greedy algorithm that iteratively removes at most one product from each nest, until the optimality condition is satisfied. Our algorithm also exploits the beautiful “l...
متن کاملThe d-Level Nested Logit Model: Assortment and Price Optimization Problems
We consider assortment and price optimization problems under the d-level nested logit model. In the assortment optimization problem, the goal is to find the revenue-maximizing assortment of products to offer, when the prices of the products are fixed. Using a novel formulation of the d-level nested logit model as a tree of depth d, we provide an efficient algorithm to find the optimal assortmen...
متن کاملAssortment Optimization under a Mixture of Mallows Model
Assortment optimization is an important problem that arises in many applications including retailing and online advertising. The goal in this problem is to determine a revenue/profit maximizing subset of products to offer from a large universe of products when customers exhibit a random substitution behavior. We suppose that demand is described by a mixture of Mallows model. This is a “smoothed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Oper. Res. Lett.
دوره 43 شماره
صفحات -
تاریخ انتشار 2015